Powerful Arithmetic Progressions
نویسنده
چکیده
We give a complete characterization of so called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملArithmetic Progressions on Conics.
In this paper, we look at long arithmetic progressions on conics. By an arithmetic progression on a curve, we mean the existence of rational points on the curve whose x-coordinates are in arithmetic progression. We revisit arithmetic progressions on the unit circle, constructing 3-term progressions of points in the first quadrant containing an arbitrary rational point on the unit circle. We als...
متن کاملA 43 INTEGERS 12 ( 2012 ) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth
In this paper, we investigate arithmetic progressions in the polygonal numbers with a fixed number of sides. We first show that four-term arithmetic progressions cannot exist. We then describe explicitly how to find all three-term arithmetic progressions. Finally, we show that not only are there infinitely many three-term arithmetic progressions, but that there are infinitely many three-term ar...
متن کاملForbidden arithmetic progressions in permutations of subsets of the integers
Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...
متن کاملSolvability of Diophantine Equations
Attila Bérczes (University of Debrecen): On arithmetic properties of solutions of norm form equations. Abstract. Let α be an algebraic number of degree n and K := Q(α). Consider the norm form equation NK/Q(x0 + x1α+ x2α + . . .+ xn−1α) = b in x0, . . . , xn−1 ∈ Z. (1) Let H denote the solution set of (1). Arranging the elements of H in an |H| × n array H, one may ask at least two natural questi...
متن کامل